Innnite Convergent String-rewriting Systems and Cross-sections for Monoids
نویسندگان
چکیده
A nitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regular cross-sections, and that, hence, cannot be presented by left-regular convergent string-rewriting systems. Also examples of nitely presented monoids with decidable word problems are presented that do not even admit context-free cross-sections. In the concluding section we shortly address the notion of left-regular convergent string-rewriting systems that are tractable.
منابع مشابه
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey
In recent years a number of conditions has been established that a monoid must necessarily satisfy if it is to have a presentation through some nite convergent string-rewriting system. Here we give a survey on this development, explaining these necessary conditions in detail and describing the relationships between them.
متن کاملSome Remarks on Nitely Presented Monoids with Automatic Structure
Groups with automatic structure (automatic groups for short) have recently received a lot of attention in the literature. They have been shown to have many nice properties, and consequently it has been asked whether these results can be carried over to monoids with automatic structure. Here we show that there exist nitely presented monoids with automatic structure that cannot be presented throu...
متن کاملFinitely presented monoids with linear Dehn function need not have regular cross-sections
This paper shows that a finitely presented monoid with linear Dehn function need not have a regular cross-section, strengthening the previously-known result that such a monoid need not be presented by a finite complete string rewriting system, and contrasting the fact that finitely presented groups with linear Dehn function always have regular cross-sections.
متن کاملOn Properties of Monoids That Are Modular for Free Products and for Certain Free Products with Amalgamated Submonoids
A property P of string-rewriting systems is called modular if the disjoint union R 1 R 2 of two string-rewriting systems R 1 and R 2 has this property if and only if R 1 and R 2 both have this property. Analogously, a property P of monoids is modular if the free product M 1 M 2 of two monoids M 1 and M 2 has this property if and only if M 1 and M 2 both have this property. Since the string-rewr...
متن کاملFp 1 Is Undecidable for Nitely Presented Monoids with Word Problems Decidable in Polynomial Time
In the rst part of this paper properties P of nitely presented monoids are considered that satisfy the following two conditions: (1) each monoid that can be presented through a nite convergent string-rewriting system has property P , and (2) each nitely presented monoid having property P is of homology type FP3. Following an idea presented in (Otto and Sattler-Klein 1997) it is shown that these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996